Constructing 4-Valent 1/2-Transitive Graphs with a Nonsolvable Automorphism Group
نویسندگان
چکیده
A graph is said to be 1 2-transitive if its automorphism group is ver-tex and edge but not arc-transitive. For each n 11, a 1 2-transitive graph of valency 4 and girth 6, with the automorphism group isomor-phic to A n Z 2 , is given.
منابع مشابه
Some Non-Normal Cayley Digraphs of the Generalized Quaternion Group of Certain Orders
We show that an action of SL(2, p), p ≥ 7 an odd prime such that 4 6 | (p − 1), has exactly two orbital digraphs Γ1, Γ2, such that Aut(Γi) admits a complete block system B of p + 1 blocks of size 2, i = 1, 2, with the following properties: the action of Aut(Γi) on the blocks of B is nonsolvable, doubly-transitive, but not a symmetric group, and the subgroup of Aut(Γi) that fixes each block of B...
متن کاملVertex-Transitive Non-Cayley Graphs with Arbitrarily Large Vertex-Stabilizer
A construction is given for an infinite family {0n} of finite vertex-transitive non-Cayley graphs of fixed valency with the property that the order of the vertex-stabilizer in the smallest vertex-transitive group of automorphisms of 0n is a strictly increasing function of n. For each n the graph is 4-valent and arc-transitive, with automorphism group a symmetric group of large prime degree p> 2...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کامل5-valent Symmetric Graphs of Order at Most 100
1 "UI,J;:"~.VU.jJ of the automorphism group is said to be symmetric on r, a,U.llo,vuuv vertices of f; f is said (that is those groups act are vertex transitive and hence are The motivation for this paper came from Lorimer [1] about determining all minimal trivalent of order at most 120. Similar work for 5-valent the order of a cornpl.ete list of most 100. In stabilizer has upper bound that is 4...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 75 شماره
صفحات -
تاریخ انتشار 1999